ISRO CSE 2018
Q51.
A class of 30 students occupy a classroom containing 5 rows of seats, with 8 seats in each row. If the students seat themselves at random, the probability that sixth seat in the fifth row will be empty is:Q52.
Procedures P1 and P2 have a producer-consumer relationship, communicating by the use of a set of shared buffers.P1 : repeat Obtain an empty buffer Fill it Return a full buffer forever P2: repeat Obtain a full buffer Empty it Return an empty buffer forever Increasing the number of buffers is likely to do which of the following? I. Increase the rate at which requests are satisfied (throughput) II. Decrease the likelihood of deadlock III. Increase the ease of achieving a correct implementationQ53.
In multi-programmed systems, it is advantageous if some programs such as editors and compilers can be shared by several users. Which of the following must be true of multi-programmed systems in order that a single copy of a program can be shared by several users? I. The program is a macro II. The program is recursive III. The program is reentrantQ54.
The running time of an algorithm is given by:T(n)=\left\{\begin{matrix} T(n-1)+T(n-2)-T(n-3), &\text { if } n>3\\ n, &\text{ otherwise}\end{matrix}\right.Then what should be the relation between T(1),T(2),T(3), so that the order of the algorithm is constant?Q56.
Immunity of the external schemas (or application programs) to changes in the conceptual scheme is referred to as:Q57.
Considering the following table in a relational database :\begin{array}{|c|c|c|c|} \hline \text { Last Name } & \text { Rank } & \text { Room } & \text { Shift } \\ \hline \text { Smith } & \text { Manager } & 234 & \text { Morning } \\ \hline \text { Jones } & \text { Custodian } & 33 & \text { Afternoon } \\ \hline \text { Smith } & \text { Custodian } & 33 & \text { Evening } \\ \hline \text { Doe } & \text { Clerical } & 222 & \text { Morning } \\ \hline \end{array}According to the data shown in the table, which of the following could be a candidate key of the table?Q58.
The time complexity of computing the transitive closure of binary relation on a set of n elements is known to beQ59.
A particular disk unit uses a bit string to record the occupancy or vacancy of its tracks, with 0 denoting vacant and 1 for occupied. A 32-bit segment of this string has hexadecimal value D4FE2003. The percentage of occupied tracks for the corresponding part of the disk, to the nearest percentage is:Q60.
The following paradigm can be used to find the solution of the problem in minimum time:Given a set of non-negative integer and a value K, determine if there is a subset of the given set with sum equal to K: